On the computational power and super Turing capabilities of dynamical systems
نویسندگان
چکیده
We explore the simulation and computational capabilities of dynamical systems We rst introduce and compare several notions of simulation between discrete systems We give a general framework that allows dynamical systems to be considered as computational machines We introduce a new discrete model of computation the analog automaton model We determine the computational power of this model and prove that it does have super Turing capabilities We then prove that many very simple dynamical systems from literature are actually able to simu late analog automata From this result we deduce that many dynamical systems have intrinsically super Turing capabilities
منابع مشابه
On the Computational Power and Super-turing Capabilities of Dynamical Systems Ecole Normale Supérieure De Lyon on the Computational Power and Super-turing Capabilities of Dynamical Systems
We explore the simulation and computational capabilities of dynamical systems. We rst introduce and compare several notions of simulation between discrete systems. We give a general framework that allows dynamical systems to be considered as computational machines. We introduce a new discrete model of computation: the analog automaton model. We determine the computational power of this model an...
متن کاملThe Super-Turing Computational Power of plastic Recurrent Neural Networks
We study the computational capabilities of a biologically inspired neural model where the synaptic weights, the connectivity pattern, and the number of neurons can evolve over time rather than stay static. Our study focuses on the mere concept of plasticity of the model so that the nature of the updates is assumed to be not constrained. In this context, we show that the so-called plastic recurr...
متن کاملOn the Computational Power of Dynamical Systems and Hybrid Systems
We explore the simulation and computational capabilities of discrete and continuous dynamical systems. We introduce and compare several notions of simulation between discrete and continuous systems. We give a general framework that allows discrete and continuous dynamical systems to be considered as computational machines. We introduce a new discrete model of computation: the analog automaton m...
متن کاملSome improvements in fuzzy turing machines
In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...
متن کاملComputation beyond the turing limit.
Extensive efforts have been made to prove the Church-Turing thesis, which suggests that all realizable dynamical and physical systems cannot be more powerful than classical models of computation. A simply described but highly chaotic dynamical system called the analog shift map is presented here, which has computational power beyond the Turing limit (super-Turing); it computes exactly like neur...
متن کامل